Parallel Very Fast Simulated Reannealing by Temperature BlockPartitioning
نویسنده
چکیده
This work describes a parallel implementation of Very Fast Simulated Reannealing (VFSR), an advanced simulated annealing method for optimization of non-linear, multi-dimensional functions with large numbers of local minima. Parallel VFSR speed-ups on a CM-2 connection machine are reported for eight functions: De Jong's test suite, a 10-D parabolic function , and two multi-modal, highly non-linear functions. Within the test set, the function characteristic most aaecting parallel VFSR performance is number of optimized function parameters. Low dimension functions prooted least from parallelization, exhibiting speedups from 2 to 78 (where speedups are based on number of function evaluation cycles). Speed-ups for the three 10-D cost functions increased to 410, 823 and 1124. On a stochastic high dimensional (D=30) quar-tic cost function, the cycle ratio was over 19000. We present results of a systematic study of the dimension-ality eeect on three test functions.
منابع مشابه
Genetic Algorithms and Very Fast Simulated Reannealing: a Comparison Lester Ingber
We compare Genetic Algorithms (GA) with a functional search method, Very Fast Simulated Reannealing (VFSR), that not only is efficient in its search strategy, but also is statistically guaranteed to find the function optima. GA previously has been demonstrated to be competitive with other standard Boltzmann-type simulated annealing techniques. Presenting a suite of six standard test functions t...
متن کاملDesign of a Broadband Microwave Amplifier Using Neural Performance Data Sheets and Very Fast Simulated Reannealing
In this work, the neural performance data sheets of the transistor are employed to determine the feasible design target space in the optimization of a microwave amplifier. The basic amplifier with a single transistor between the input and output matching circuits (IMC and OMC) is also worked out. Very Fast Simulated Reannealing (VFSR) is utilized in the multi objective optimization process for ...
متن کاملStochastic Orientation of the Generating Distribution in Very Fast Simulated Reannealing
The Very Fast Simulated Reannealing algorithm has been shown to perform well when minimizing diicult and complex functions. However, because the VFSR generating distribution is aligned along the coordinate axes, the performance of the algorithm can be sensitive to the local orientation and shape of the objective function system. Performance degradation can occur, for example, when the objective...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994